منابع مشابه
On automorphism groups of circulant digraphs of square-free order
We show that the full automorphism group of a circulant digraph of square-free order is either the intersection of two 2-closed groups, each of which is the wreath product of 2-closed groups of smaller degree, or contains a transitive normal subgroup which is the direct product of two 2-closed groups of smaller degree. The work in this paper makes contributions to the solutions of two problems ...
متن کاملGROUPS OF SQUARE - FREE ORDER , AN ALGORITHM 633 Definition
An abstract definition of the groups of square-free order is given that leads naturally to a programmable computation of their number. O. Holder's alternative description of the groups of square-free order is incidentally derived. Throughout this paper G will be a group of order h = n^j p;, where Pj > p2 > • • • >p„ are given prime numbers. 0. Holder proved in 1895 that the number of groups of ...
متن کاملSquare free values of the order function
Given a ∈ Z \ {±1, 0}, we consider the problem of enumerating the integers m coprime to a such that the order of a modulo m is square free. This question is raised in analogy to a result recently proved jointly with F. Saidak and I. Shparlinski where square free values of the Carmichael function are studied. The technique is the one of Hooley that uses the Chebotarev Density Theorem to enumerat...
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2007
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2007.01.006